Mixed-Integer and Conditional Trajectory Planning for an Autonomous Mining Truck in Loading/Dumping Scenarios: A Global Optimization Approach

نویسندگان

چکیده

Trajectory planning for a heavy-duty mining truck near the loading/dumping sites of an open-pit mine is difficult. As opposed to trajectory small-sized passenger car in parking lot, involves complex factors vehicle kinematics and environment. These make concerned scheme mixed-integer nonlinear program (MINLP) incorporated with conditional constraints (denoted as C-MINLP). MINLP solvers can neither deal nor find global optima real time. Instead solving C-MINLP directly, we build from-coarse-to-fine framework so that coupled difficulties (the mixed integral variables, constraints, demand optimality) are divided conquered. At coarse search stage, global-optimality-enhanced hybrid A * algorithm proposed near-optimal kinematic optimality considered. The further polished at refinement wherein nominal simplified small-scale NLP. solution NLP optimized trajectory, which does not violate C-MINLP. This indicates conversion from efficient help high-quality trajectory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trajectory Optimization using Mixed-Integer Linear Programming

This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of decisions about terminal constraints in the optimization, such as assignment of waypoints to UAVs and the ...

متن کامل

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

An exact penalty global optimization approach for mixed-integer programming problems

In this work, we propose a global optimization approach for mixed-integer programming problems. To this aim, we preliminarily define an exact penalty algorithm model for globally solving general problems and we show its convergence properties. Then, we describe a particular version of the algorithm that solves mixed integer problems.

متن کامل

Global Optimization of Mixed-Integer Nonlinear Problems

Two novel deterministic global optimization algorithms for nonconvex mixed-integer problems (MINLPs) are proposed, using the advances of the BB algorithm for noncon-vex NLPs Adjiman et al. (1998a). The Special Structure Mixed-Integer BB algorithm (SMIN-BB addresses problems with nonconvexities in the continuous variables and linear and mixed-bilinear participation of the binary variables. The G...

متن کامل

Global Optimization of Mixed-Integer Nonlinear Programs

A variety of applications in economics, finance, engineering design, the chemical and biological sciences, and a host of other areas give rise to nonconvex nonlinear and mixed-integer nonlinear programs (NLPs and MINLPs). BARON was originally developed in the early 1990s as a computational system to facilitate experimentation with novel deterministic algorithms for global optimization. Since th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE transactions on intelligent vehicles

سال: 2023

ISSN: ['2379-8904', '2379-8858']

DOI: https://doi.org/10.1109/tiv.2022.3214777